Practical and Efficient Split Decomposition via Graph-Labelled Trees
نویسندگان
چکیده
منابع مشابه
Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs
In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs, also known as the distance hereditary graphs, and for two non-trivial subclasses, namely the cographs and the 3-leaf power graphs. Precisely, we give strutural and incremental characterizations, leading to optimal fullydynamic recognition a...
متن کاملStructural Decomposition Trees: Semantic and Practical Implications
The visualization of high-dimensional data is a challenging research topic. Existing approaches can usually be assigned to either relation or value visualizations. Merging approaches from both classes into a single integrated strategy, Structural Decomposition Trees (SDTs) represent a completely novel visualization approach for high-dimensional data. Although this method is new and promising, s...
متن کاملColoring a Graph Using Split Decomposition
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular we present an O(nm) algorithm to compute the chromatic number for all those graphs having a split decomposition in which every prime graph is an induced subgraph of either a Ck or a Ck for some k ≥ 3.
متن کاملEfficient Parsing for Head-Split Dependency Trees
Head splitting techniques have been successfully exploited to improve the asymptotic runtime of parsing algorithms for projective dependency trees, under the arc-factored model. In this article we extend these techniques to a class of non-projective dependency trees, called well-nested dependency trees with block-degree at most 2, which has been previously investigated in the literature. We def...
متن کاملDecomposition of Trees and Paths via Correlation
We study the problem of decomposing (clustering) a tree with respect to costs attributed to pairs of nodes, so as to minimize the sum of costs for those pairs of nodes that are in the same component (cluster). For the general case and for the special case of the tree being a star, we show that the problem is np-hard. For the special case of the tree being a path, this problem is known to be pol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2013
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-013-9752-9